Choosing panels of genomics assays using submodular optimization
نویسندگان
چکیده
منابع مشابه
Mining Interesting Itemsets using Submodular Optimization
We propose a novel technique to retrieve itemsets that best explain a transaction database by leveraging a simple probabilistic model. Our approach is the first to infer such interesting itemsets directly from the transaction database using submodular function optimization and in so doing avoids many of the pitfalls commonly present in frequent itemset mining algorithms. Our proposed approach i...
متن کاملSubmodular Optimization with Submodular Cover and Submodular Knapsack Constraints
We investigate two new optimization problems — minimizing a submodular function subject to a submodular lower bound constraint (submodular cover) and maximizing a submodular function subject to a submodular upper bound constraint (submodular knapsack). We are motivated by a number of real-world applications in machine learning including sensor placement and data subset selection, which require ...
متن کاملConstrained Robust Submodular Optimization
In this paper, we consider the problem of constrained maximization of the minimum of a set of submodular functions, in which the goal is to find solutions that are robust to worst-case values of the objective functions. Unfortunately, this problem is both non-submodular and inapproximable. In the case where the submodular functions are monotone, an approximate solution can be found by relaxing ...
متن کاملRisk-Sensitive Submodular Optimization
The conditional value at risk (CVaR) is a popular risk measure which enables risk-averse decision making under uncertainty. We consider maximizing the CVaR of a continuous submodular function, an extension of submodular set functions to a continuous domain. One example application is allocating a continuous amount of energy to each sensor in a network, with the goal of detecting intrusion or co...
متن کاملMulti-Agent Submodular Optimization
Recent years have seen many algorithmic advances in the area of submodular optimization: (SO) min /max f(S) : S ∈ F , where F is a given family of feasible sets over a ground set V and f : 2 → R is submodular. This progress has been coupled with a wealth of new applications for these models. Our focus is on a more general class of multi-agent submodular optimization (MASO) which was introduced ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Genome Biology
سال: 2016
ISSN: 1474-760X
DOI: 10.1186/s13059-016-1089-7